#if 1
#include <windows.h>
#include <stdio.h>
#include <stdlib.h>
#include <assert.h>
#include "../DataStructure/string.h"
#include "../DataStructure/bitmap.h"
#include "../DataStructure/TrieTree.h"
#include "../DataStructure/SingleList.h"
#include "../Algorithm/InsertionSort.h"
int main()
{
	int arr[] = { 2,1,8,4,5,9,7,3,6 };
	int length = sizeof(arr) / sizeof(int);
	int end = length;

	InsertionSort(arr, arr + end - 1);

	for (size_t i = 0; i < length; i++)
	{
		printf("%d\n", arr[i]);
	}
	printf("end\n");
	getchar();
	return 0;
}
#endif // 0


